Singlet generation in mixed-state quantum networks
نویسندگان
چکیده
منابع مشابه
Mixed-state quantum transport in correlated spin networks
Quantum spin networks can be used to transport information between separated registers in a quantuminformation processor. To find a practical implementation, the strict requirements of ideal models for perfect state transfer need to be relaxed, allowing for complex coupling topologies and general initial states. Here we analyze transport in complex quantum spin networks in the maximally mixed s...
متن کاملConverting two-atom singlet state into three-atom singlet state via quantum Zeno dynamics
An approach is presented for converting a two-atom singlet state into a three-atom singlet state based on the quantum Zeno dynamics induced by continuous coupling. The scheme can be achieved within one step through appropriately regulating the Rabi frequencies of the classical fields. The effects of decoherence such as atomic spontaneous emission and the loss of cavity are also considered in vi...
متن کاملAdiabatic Quantum State Generation
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to this task by studying the problem of quantum state generation. We motivate this problem by showing that the entire class of statistical zero knowledge, which contains natural candidates for efficient quantum algorithms such as graph isomorphism and lattice problems, ca...
متن کاملMixed-state entanglement and quantum error correction.
Entanglement purification protocols (EPP) and quantum errorcorrecting codes (QECC) provide two ways of protecting quantum states from interaction with the environment. In an EPP, perfectly entangled pure states are extracted, with some yield D, from a bipartite mixed state M ; with a QECC, an arbitrary quantum state |ξ〉 can be transmitted at some rate Q through a noisy channel χ without degrada...
متن کاملImproved constructions of mixed state quantum automata
Quantum finite automata with mixed states are proved to be super-exponentially more concise rather than quantum finite automata with pure states. It was proved earlier by A. Ambainis and R. Freivalds that quantum finite automata with pure states can have an exponentially smaller number of states than deterministic finite automata recognizing the same language. There was an unpublished ‘‘folk th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2010
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.81.042316